An Information-Based Neural Approach to Constraint Satisfaction
نویسندگان
چکیده
منابع مشابه
An information-based neural approach to generic constraint satisfaction
A novel artificial neural network heuristic (INN) for general constraint satisfaction problems is presented, extending a recently suggested method restricted to boolean variables. In contrast to conventional ANN methods, it employs a particular type of non-polynomial cost function, based on the information balance between variables and constraints in a mean-field setting. Implemented as an anne...
متن کاملAn Information-Based Neural Approach to Constraint Satisfaction
A novel artificial neural network approach to constraint satisfaction problems is presented. Based on information-theoretical considerations, it differs from a conventional mean-field approach in the form of the resulting free energy. The method, implemented as an annealing algorithm, is numerically explored on a testbed of K-SAT problems. The performance shows a dramatic improvement over that ...
متن کاملAn Information-based Neural Approach to Constraint Satisfaction Submitted to Neural Computation
A novel artiicial neural network approach to constraint satisfaction problems is presented. Based on information-theoretical considerations, it diiers from a conventional mean-eld approach in the form of the resulting free energy. The method, implemented as an annealing algorithm, is numerically explored on a testbed of K-SAT problems. The performance shows a dramatic improvement to that of a c...
متن کاملLU TP 00-40 An Information-Based Neural Approach to Generic Constraint Satisfaction
A novel artificial neural network heuristic (INN) for general constraint satisfaction problems is presented, extending a recently suggested method restricted to boolean variables. In contrast to conventional ANN methods, it employs a particular type of non-polynomial cost function, based on the information balance between variables and constraints in a mean-field setting. Implemented as an anne...
متن کاملAn Algebraic Approach to Constraint Satisfaction Problems
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If the CSP has n variables whose domain size is m, and if the equivalent programming problem involves M equations, then the number of solutions can be determined in time O(nm2M−n). This surprising link between search probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computation
سال: 2001
ISSN: 0899-7667,1530-888X
DOI: 10.1162/08997660152469369